منابع مشابه
Asymptotic performance of multiple description transform codes
The multiple description transform coder is introduced for sources with memory and an asymptotic analysis is presented for the squared error distortion. For stationary Gaussian sources, the optimal transform and the optimal bit allocation for the multiple description coder are identical to those for the single description coder.
متن کاملAnalysis of the Asymptotic Performance of Turbo Codes
Battail [1989] shows that an appropriate criterion for the design of long block codes is the closeness of the normalized weight distribution to Gaussian. A subsequent work by Biglieri and Volski [1994] shows that iterated product of single parity check codes satisfies this criterion. Motivated by these works, in the current article, we study the performance of turbo codes for large block length...
متن کاملSpace-time codes for high bit rate wireless communications: asymptotic performance of space-time random codes
To quantify the diversity gain of Space-Time coding, obtained by increasing the number of transmit and receive antennas, in this paper we use the paradigm of random codes, modelling Space-Time codes as random matrices with zero mean, equal variance and independent entries having a common arbitrary distribution (discrete or continuous). This framework is especially convenient in this situation b...
متن کاملAsymptotic behaviors of population codes
The present study investigates asymptotic behaviors of population codes, i.e., their performances when the number of neurons goes to in*nity. Since the number of neurons involved in population coding is often large, asymptotic behaviors are the properties of biologic relevance. This study is based on a neural *eld model for the encoding process, which has a simple form, whereas, covers a broad ...
متن کاملAsymptotic Overview on Separating Codes
Separating codes (or systems) are known from combinatorics, and they enjoy increasing attention due to applications in digital fingerprinting. Previous applications are found in automata theory and the construction of fault-tolerant systems. Let Γ be a code of length n, and (T,U ) a pair of disjoint subsets of Γ. We say that (T,U ) is separated if there exists a coordinate i, such that for any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111885